./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/sum_by_3.c --full-output --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/loops-crafted-1/sum_by_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 cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b --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-11 19:33:15,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:33:15,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:33:15,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:33:15,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:33:15,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:33:15,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:33:15,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:33:15,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:33:15,616 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:33:15,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:33:15,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:33:15,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:33:15,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:33:15,619 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:33:15,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:33:15,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:33:15,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:33:15,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:33:15,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:33:15,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:33:15,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:33:15,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:33:15,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:33:15,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:33:15,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:33:15,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:33:15,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:33:15,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:33:15,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:33:15,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:33:15,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:33:15,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:33:15,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:33:15,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:33:15,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:33:15,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:33:15,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:33:15,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:33:15,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:33:15,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:33:15,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:33:15,627 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 -> cbdeb806056afbf44cc985ff91f53f00e848d18cfefb92d1f6744eb19cf6d91b 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-11 19:33:15,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:33:15,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:33:15,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:33:15,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:33:15,902 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:33:15,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2024-09-11 19:33:17,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:33:17,438 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:33:17,439 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/sum_by_3.c [2024-09-11 19:33:17,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/2636ed832/6357b25a5e9f45ab8488ec2ccab7bcf5/FLAG3ef7cb293 [2024-09-11 19:33:17,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/2636ed832/6357b25a5e9f45ab8488ec2ccab7bcf5 [2024-09-11 19:33:17,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:33:17,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:33:17,464 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:33:17,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:33:17,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:33:17,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3cb293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17, skipping insertion in model container [2024-09-11 19:33:17,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:33:17,650 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/loops-crafted-1/sum_by_3.c[406,419] [2024-09-11 19:33:17,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:33:17,674 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:33:17,684 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/loops-crafted-1/sum_by_3.c[406,419] [2024-09-11 19:33:17,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:33:17,702 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:33:17,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17 WrapperNode [2024-09-11 19:33:17,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:33:17,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:33:17,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:33:17,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:33:17,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,739 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,773 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 46 [2024-09-11 19:33:17,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:33:17,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:33:17,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:33:17,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:33:17,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,795 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-11 19:33:17,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:33:17,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:33:17,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:33:17,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:33:17,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (1/1) ... [2024-09-11 19:33:17,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:33:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:17,846 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-11 19:33:17,849 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-11 19:33:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:33:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:33:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:33:17,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:33:17,956 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:33:17,958 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:33:18,078 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-11 19:33:18,078 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:33:18,099 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:33:18,100 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-11 19:33:18,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:33:18 BoogieIcfgContainer [2024-09-11 19:33:18,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:33:18,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:33:18,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:33:18,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:33:18,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:33:17" (1/3) ... [2024-09-11 19:33:18,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f47899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:33:18, skipping insertion in model container [2024-09-11 19:33:18,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:33:17" (2/3) ... [2024-09-11 19:33:18,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f47899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:33:18, skipping insertion in model container [2024-09-11 19:33:18,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:33:18" (3/3) ... [2024-09-11 19:33:18,110 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_by_3.c [2024-09-11 19:33:18,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:33:18,126 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:33:18,170 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:33:18,178 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;@3b713acd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:33:18,178 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:33:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 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-11 19:33:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:33:18,188 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:18,188 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:18,189 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:18,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2014067451, now seen corresponding path program 1 times [2024-09-11 19:33:18,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:18,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790555891] [2024-09-11 19:33:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:18,344 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-11 19:33:18,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:18,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790555891] [2024-09-11 19:33:18,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790555891] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:33:18,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:33:18,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:33:18,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278641714] [2024-09-11 19:33:18,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:33:18,351 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:33:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:33:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:33:18,375 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 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) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11 19:33:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:18,392 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2024-09-11 19:33:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:33:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) Word has length 10 [2024-09-11 19:33:18,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:18,399 INFO L225 Difference]: With dead ends: 25 [2024-09-11 19:33:18,399 INFO L226 Difference]: Without dead ends: 11 [2024-09-11 19:33:18,401 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 19:33:18,404 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:18,407 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:33:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-09-11 19:33:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-09-11 19:33:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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-11 19:33:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2024-09-11 19:33:18,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 10 [2024-09-11 19:33:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:18,428 INFO L474 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2024-09-11 19:33:18,428 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11 19:33:18,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2024-09-11 19:33:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:33:18,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:18,429 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:18,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:33:18,430 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:18,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:18,430 INFO L85 PathProgramCache]: Analyzing trace with hash -662206593, now seen corresponding path program 1 times [2024-09-11 19:33:18,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:18,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652581623] [2024-09-11 19:33:18,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:18,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:19,365 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-11 19:33:19,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:19,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652581623] [2024-09-11 19:33:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652581623] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:33:19,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:33:19,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:33:19,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573910408] [2024-09-11 19:33:19,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:33:19,368 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:33:19,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:19,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:33:19,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:33:19,371 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-11 19:33:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:19,493 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2024-09-11 19:33:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:33:19,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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) Word has length 10 [2024-09-11 19:33:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:19,495 INFO L225 Difference]: With dead ends: 26 [2024-09-11 19:33:19,495 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 19:33:19,496 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:33:19,498 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:19,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:33:19,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 19:33:19,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2024-09-11 19:33:19,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-11 19:33:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-09-11 19:33:19,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 10 [2024-09-11 19:33:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:19,509 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-09-11 19:33:19,509 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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-11 19:33:19,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-09-11 19:33:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:33:19,511 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:19,511 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:19,511 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:33:19,511 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:19,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1958550681, now seen corresponding path program 1 times [2024-09-11 19:33:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:19,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218342602] [2024-09-11 19:33:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:20,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:20,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218342602] [2024-09-11 19:33:20,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218342602] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605586990] [2024-09-11 19:33:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:20,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:20,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:20,971 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-11 19:33:20,973 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-11 19:33:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:21,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 19:33:21,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:33:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:21,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:33:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:21,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605586990] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:33:21,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:33:21,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2024-09-11 19:33:21,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688872813] [2024-09-11 19:33:21,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:33:21,525 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 19:33:21,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:21,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 19:33:21,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:33:21,526 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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-11 19:33:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:22,412 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2024-09-11 19:33:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-11 19:33:22,413 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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) Word has length 11 [2024-09-11 19:33:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:22,415 INFO L225 Difference]: With dead ends: 56 [2024-09-11 19:33:22,415 INFO L226 Difference]: Without dead ends: 41 [2024-09-11 19:33:22,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=1050, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 19:33:22,417 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 129 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:22,417 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 21 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:33:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-11 19:33:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 23. [2024-09-11 19:33:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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-11 19:33:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-09-11 19:33:22,441 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2024-09-11 19:33:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:22,441 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-09-11 19:33:22,441 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 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-11 19:33:22,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-09-11 19:33:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 19:33:22,442 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:22,442 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:22,460 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 19:33:22,643 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:22,643 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:22,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:22,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2010868069, now seen corresponding path program 1 times [2024-09-11 19:33:22,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:22,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859558589] [2024-09-11 19:33:22,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859558589] [2024-09-11 19:33:22,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859558589] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:22,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388630120] [2024-09-11 19:33:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:22,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:22,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:22,862 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-11 19:33:22,863 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-11 19:33:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:22,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:33:22,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:33:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:33:22,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:33:22,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388630120] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:33:22,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:33:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-09-11 19:33:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436739351] [2024-09-11 19:33:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:33:22,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:33:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:22,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:33:22,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:33:22,933 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11 19:33:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:22,977 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-11 19:33:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:33:22,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 13 [2024-09-11 19:33:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:22,979 INFO L225 Difference]: With dead ends: 29 [2024-09-11 19:33:22,980 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 19:33:22,980 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:33:22,981 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:22,981 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:33:22,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 19:33:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-11 19:33:22,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-11 19:33:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-11 19:33:22,993 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2024-09-11 19:33:22,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:22,994 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-11 19:33:22,994 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11 19:33:22,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-11 19:33:22,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 19:33:22,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:22,995 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:23,012 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:33:23,195 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:23,196 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:23,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash -415947302, now seen corresponding path program 1 times [2024-09-11 19:33:23,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235465358] [2024-09-11 19:33:23,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:23,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:23,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235465358] [2024-09-11 19:33:23,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235465358] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939376977] [2024-09-11 19:33:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:23,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:23,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:23,421 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-11 19:33:23,424 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-11 19:33:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:23,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 19:33:23,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:33:23,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:23,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:33:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 19:33:23,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939376977] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:23,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:33:23,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 11 [2024-09-11 19:33:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024235052] [2024-09-11 19:33:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:33:23,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:33:23,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:33:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:33:23,686 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11 19:33:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:23,724 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-11 19:33:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:33:23,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 13 [2024-09-11 19:33:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:23,726 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:33:23,726 INFO L226 Difference]: Without dead ends: 15 [2024-09-11 19:33:23,726 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:33:23,727 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:23,727 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 10 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:33:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-11 19:33:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-11 19:33:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-11 19:33:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-09-11 19:33:23,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2024-09-11 19:33:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:23,734 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-09-11 19:33:23,734 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11 19:33:23,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-09-11 19:33:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:33:23,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:23,735 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:23,752 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-11 19:33:23,936 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:23,936 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:23,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash 64028159, now seen corresponding path program 2 times [2024-09-11 19:33:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:23,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842149391] [2024-09-11 19:33:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:23,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:24,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842149391] [2024-09-11 19:33:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842149391] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123804516] [2024-09-11 19:33:24,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:33:24,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:24,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:24,507 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-11 19:33:24,508 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-11 19:33:24,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:33:24,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:33:24,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 19:33:24,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:33:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:24,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:33:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123804516] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:33:25,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:33:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-09-11 19:33:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985350582] [2024-09-11 19:33:25,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:33:25,211 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-11 19:33:25,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-11 19:33:25,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2024-09-11 19:33:25,212 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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-11 19:33:31,087 WARN L293 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 58 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:33:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:42,818 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-11 19:33:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 19:33:42,818 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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) Word has length 14 [2024-09-11 19:33:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:42,819 INFO L225 Difference]: With dead ends: 34 [2024-09-11 19:33:42,819 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 19:33:42,820 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=350, Invalid=1372, Unknown=0, NotChecked=0, Total=1722 [2024-09-11 19:33:42,820 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 75 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:42,821 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 20 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-09-11 19:33:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 19:33:42,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 19:33:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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-11 19:33:42,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-09-11 19:33:42,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2024-09-11 19:33:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:42,834 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-09-11 19:33:42,834 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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-11 19:33:42,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-09-11 19:33:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:33:42,835 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:42,836 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:33:42,849 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:33:43,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:43,036 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:43,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:43,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1089902527, now seen corresponding path program 3 times [2024-09-11 19:33:43,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125470803] [2024-09-11 19:33:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:33:45,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125470803] [2024-09-11 19:33:45,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125470803] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:45,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332225843] [2024-09-11 19:33:45,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:33:45,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:45,092 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-11 19:33:45,092 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-11 19:33:45,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:33:45,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:33:45,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 19:33:45,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:33:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-11 19:33:45,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:33:45,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332225843] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:33:45,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:33:45,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2024-09-11 19:33:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233987719] [2024-09-11 19:33:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:33:45,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:33:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:33:45,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2024-09-11 19:33:45,682 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-11 19:33:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:45,806 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-09-11 19:33:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:33:45,807 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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) Word has length 20 [2024-09-11 19:33:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:45,807 INFO L225 Difference]: With dead ends: 21 [2024-09-11 19:33:45,807 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:33:45,808 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2024-09-11 19:33:45,808 INFO L434 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:45,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:33:45,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:33:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:33:45,809 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-11 19:33:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:33:45,809 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2024-09-11 19:33:45,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:45,810 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:33:45,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 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-11 19:33:45,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:33:45,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:33:45,813 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:33:45,830 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:33:46,014 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:33:46,017 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-09-11 19:33:46,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:33:53,017 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 115 DAG size of output: 40 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-11 19:33:58,489 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 139 DAG size of output: 51 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-11 19:33:58,691 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:33:58,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:33:58 BoogieIcfgContainer [2024-09-11 19:33:58,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:33:58,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:33:58,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:33:58,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:33:58,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:33:18" (3/4) ... [2024-09-11 19:33:58,714 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:33:58,720 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-11 19:33:58,721 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 19:33:58,721 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:33:58,721 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:33:58,805 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:33:58,806 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:33:58,806 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:33:58,807 INFO L158 Benchmark]: Toolchain (without parser) took 41344.06ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 90.2MB in the beginning and 156.3MB in the end (delta: -66.1MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-09-11 19:33:58,807 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:33:58,807 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.56ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 78.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:33:58,807 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.10ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 120.0MB in the end (delta: -41.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:33:58,807 INFO L158 Benchmark]: Boogie Preprocessor took 30.51ms. Allocated memory is still 148.9MB. Free memory was 120.0MB in the beginning and 118.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:33:58,807 INFO L158 Benchmark]: RCFGBuilder took 294.61ms. Allocated memory is still 148.9MB. Free memory was 118.1MB in the beginning and 107.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 19:33:58,808 INFO L158 Benchmark]: TraceAbstraction took 40608.44ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 106.2MB in the beginning and 49.5MB in the end (delta: 56.8MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2024-09-11 19:33:58,808 INFO L158 Benchmark]: Witness Printer took 94.51ms. Allocated memory is still 188.7MB. Free memory was 49.5MB in the beginning and 156.3MB in the end (delta: -106.8MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-09-11 19:33:58,810 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.56ms. Allocated memory is still 148.9MB. Free memory was 90.2MB in the beginning and 78.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.10ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 120.0MB in the end (delta: -41.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.51ms. Allocated memory is still 148.9MB. Free memory was 120.0MB in the beginning and 118.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 294.61ms. Allocated memory is still 148.9MB. Free memory was 118.1MB in the beginning and 107.0MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 40608.44ms. Allocated memory was 148.9MB in the beginning and 188.7MB in the end (delta: 39.8MB). Free memory was 106.2MB in the beginning and 49.5MB in the end (delta: 56.8MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. * Witness Printer took 94.51ms. Allocated memory is still 188.7MB. Free memory was 49.5MB in the beginning and 156.3MB in the end (delta: -106.8MB). Peak memory consumption was 2.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: 10]: 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 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532 IncrementalHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 36 mSDtfsCounter, 532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=3, InterpolantAutomatonStates: 73, 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, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 162 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 3409 SizeOfPredicates, 12 NumberOfNonLiveVariables, 239 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 66/163 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: 25]: Loop Invariant Derived loop invariant: (((((((n % 4294967296) <= (i % 4294967296)) && (((((long long) 3 * i) % 4294967296) / 3) <= 20000001)) && ((((((long long) 2 * j) + i) % 4294967296) / 3) <= 20000001)) && (SIZE == 20000001)) && ((n % 4294967296) <= ((long long) j % 4294967296))) || ((((i == 0) && ((n % 4294967296) <= 20000001)) && (SIZE == 20000001)) && ((((long long) (j % 2147483648) * 2) / 3) <= 20000001))) - InvariantResult [Line: 16]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 8]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: ((((i == 0) && ((n % 4294967296) <= 20000001)) && (SIZE == 20000001)) || ((((((4294967295 + i) % 4294967296) + 1) <= (n % 4294967296)) && ((n % 4294967296) <= 20000001)) && (SIZE == 20000001))) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((n % 4294967296) <= (i % 4294967296)) && (((((long long) 3 * i) % 4294967296) / 3) <= 20000001)) && ((n % 4294967296) <= (k % 4294967296))) && (((((i + j) + k) % 4294967296) / 3) <= 20000001)) && ((((((long long) 2 * j) + i) % 4294967296) / 3) <= 20000001)) && (SIZE == 20000001)) && ((n % 4294967296) <= ((long long) j % 4294967296))) || (((((i == 0) && ((n % 4294967296) <= 20000001)) && ((((j + k) % 4294967296) / 3) <= 20000001)) && (SIZE == 20000001)) && ((((long long) (j % 2147483648) * 2) / 3) <= 20000001))) || ((((((((((3 + ((long long) 3 * i)) % 4294967296) / 3) < 20000002) && (((((long long) 3 * i) % 4294967296) / 3) <= 20000001)) && ((n % 4294967296) <= (k % 4294967296))) && (((((i + j) + k) % 4294967296) / 3) <= 20000001)) && ((((((long long) 2 * j) + i) % 4294967296) / 3) <= 20000001)) && (SIZE == 20000001)) && ((n % 4294967296) <= ((long long) j % 4294967296)))) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:33:58,844 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