./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.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/loop-lit/gj2007.c.i.p+lhb-reducer.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 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 --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:23:18,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:23:18,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:23:18,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:23:18,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:23:18,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:23:18,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:23:18,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:23:18,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:23:18,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:23:18,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:23:18,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:23:18,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:23:18,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:23:18,350 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:23:18,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:23:18,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:23:18,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:23:18,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:23:18,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:23:18,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:23:18,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:23:18,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:23:18,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:23:18,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:23:18,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:23:18,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:23:18,358 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:23:18,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:23:18,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:23:18,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:23:18,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:23:18,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:18,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:23:18,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:23:18,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:23:18,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:23:18,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:23:18,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:23:18,375 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:23:18,375 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:23:18,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:23:18,376 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 -> 1ae3736aabcb020d122100864e41791456e1f94490735ab1a93eef5c54883fe7 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:23:18,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:23:18,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:23:18,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:23:18,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:23:18,657 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:23:18,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-11 19:23:20,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:23:20,322 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:23:20,323 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c [2024-09-11 19:23:20,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f6cda9ce2/71c03c9a3e234b35b39ecdc442d08bd4/FLAG7e7c2311d [2024-09-11 19:23:20,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f6cda9ce2/71c03c9a3e234b35b39ecdc442d08bd4 [2024-09-11 19:23:20,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:23:20,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:23:20,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:20,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:23:20,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:23:20,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3e307d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20, skipping insertion in model container [2024-09-11 19:23:20,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:23:20,540 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-11 19:23:20,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:20,560 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:23:20,577 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gj2007.c.i.p+lhb-reducer.c[1613,1626] [2024-09-11 19:23:20,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:23:20,598 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:23:20,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20 WrapperNode [2024-09-11 19:23:20,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:23:20,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:20,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:23:20,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:23:20,608 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:23:20" (1/1) ... [2024-09-11 19:23:20,615 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:23:20" (1/1) ... [2024-09-11 19:23:20,636 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 115 [2024-09-11 19:23:20,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:23:20,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:23:20,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:23:20,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:23:20,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,671 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:23:20,671 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:23:20,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:23:20,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:23:20,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:23:20,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (1/1) ... [2024-09-11 19:23:20,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:23:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:20,725 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:23:20,731 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:23:20,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:23:20,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:23:20,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:23:20,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:23:20,838 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:23:20,840 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:23:21,026 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-11 19:23:21,026 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:23:21,050 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:23:21,050 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 19:23:21,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:21 BoogieIcfgContainer [2024-09-11 19:23:21,050 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:23:21,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:23:21,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:23:21,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:23:21,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:23:20" (1/3) ... [2024-09-11 19:23:21,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f4aefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:21, skipping insertion in model container [2024-09-11 19:23:21,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:23:20" (2/3) ... [2024-09-11 19:23:21,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f4aefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:23:21, skipping insertion in model container [2024-09-11 19:23:21,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:21" (3/3) ... [2024-09-11 19:23:21,058 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+lhb-reducer.c [2024-09-11 19:23:21,073 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:23:21,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:23:21,136 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:23:21,142 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;@61ba9f6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:23:21,142 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:23:21,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 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:23:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:21,151 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:21,152 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:21,152 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:21,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:21,157 INFO L85 PathProgramCache]: Analyzing trace with hash -772093082, now seen corresponding path program 1 times [2024-09-11 19:23:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:21,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131698927] [2024-09-11 19:23:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:21,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:21,420 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:23:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:21,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131698927] [2024-09-11 19:23:21,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131698927] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:21,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:21,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:23:21,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988062501] [2024-09-11 19:23:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:21,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:21,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:21,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:21,460 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 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 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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:23:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:21,565 INFO L93 Difference]: Finished difference Result 49 states and 87 transitions. [2024-09-11 19:23:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:21,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:21,575 INFO L225 Difference]: With dead ends: 49 [2024-09-11 19:23:21,575 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:23:21,578 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:21,581 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:21,582 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:21,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:23:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-11 19:23:21,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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:23:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2024-09-11 19:23:21,610 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 22 [2024-09-11 19:23:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:21,610 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2024-09-11 19:23:21,611 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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:23:21,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2024-09-11 19:23:21,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:21,612 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:21,612 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:21,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:23:21,613 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:21,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 840074483, now seen corresponding path program 1 times [2024-09-11 19:23:21,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332380429] [2024-09-11 19:23:21,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:21,714 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:23:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332380429] [2024-09-11 19:23:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332380429] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472487297] [2024-09-11 19:23:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:21,717 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:23:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:23:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:23:21,718 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:23:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:21,781 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2024-09-11 19:23:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:23:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:21,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:21,783 INFO L225 Difference]: With dead ends: 43 [2024-09-11 19:23:21,783 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:23:21,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:23:21,784 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:21,785 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:23:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-11 19:23:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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:23:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-09-11 19:23:21,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 22 [2024-09-11 19:23:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:21,794 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-09-11 19:23:21,794 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:23:21,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:21,795 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-09-11 19:23:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:21,796 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:21,797 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:21,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:23:21,797 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:21,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:21,799 INFO L85 PathProgramCache]: Analyzing trace with hash -231082731, now seen corresponding path program 1 times [2024-09-11 19:23:21,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:21,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353148046] [2024-09-11 19:23:21,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:21,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:21,893 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:23:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:21,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353148046] [2024-09-11 19:23:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353148046] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:21,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:21,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154216073] [2024-09-11 19:23:21,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:21,894 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:21,896 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:23:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:22,016 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2024-09-11 19:23:22,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:22,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:22,019 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:23:22,020 INFO L226 Difference]: Without dead ends: 38 [2024-09-11 19:23:22,021 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:22,022 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:22,024 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-11 19:23:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-11 19:23:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 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:23:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-09-11 19:23:22,035 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 22 [2024-09-11 19:23:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:22,035 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-09-11 19:23:22,036 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:23:22,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-09-11 19:23:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:22,037 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:22,037 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:22,037 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:23:22,037 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:22,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1882449068, now seen corresponding path program 1 times [2024-09-11 19:23:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:22,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453538014] [2024-09-11 19:23:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:22,195 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:23:22,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:22,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453538014] [2024-09-11 19:23:22,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453538014] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:22,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:22,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:23:22,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813492837] [2024-09-11 19:23:22,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:22,198 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:23:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:22,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:23:22,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:22,199 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:23:22,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:22,276 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-09-11 19:23:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:23:22,276 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:22,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:22,277 INFO L225 Difference]: With dead ends: 51 [2024-09-11 19:23:22,278 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:23:22,278 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:23:22,282 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:22,283 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:23:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-11 19:23:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 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:23:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-09-11 19:23:22,294 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2024-09-11 19:23:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:22,295 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-09-11 19:23:22,296 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:23:22,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-09-11 19:23:22,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:22,298 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:22,299 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:22,299 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:23:22,299 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:22,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1915141375, now seen corresponding path program 1 times [2024-09-11 19:23:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760519230] [2024-09-11 19:23:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:22,420 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:23:22,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760519230] [2024-09-11 19:23:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760519230] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:22,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:23:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121670936] [2024-09-11 19:23:22,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:22,422 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 19:23:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:22,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 19:23:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:23:22,423 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:23:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:22,479 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2024-09-11 19:23:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:23:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:22,482 INFO L225 Difference]: With dead ends: 43 [2024-09-11 19:23:22,482 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 19:23:22,482 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:23:22,485 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:22,486 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 19:23:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-11 19:23:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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:23:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-09-11 19:23:22,497 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 22 [2024-09-11 19:23:22,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:22,497 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-09-11 19:23:22,498 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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:23:22,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-09-11 19:23:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:22,499 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:22,499 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:22,499 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:23:22,501 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:22,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1558461783, now seen corresponding path program 1 times [2024-09-11 19:23:22,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:22,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682388381] [2024-09-11 19:23:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:22,559 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:23:22,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:22,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682388381] [2024-09-11 19:23:22,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682388381] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:22,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:22,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:23:22,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513995188] [2024-09-11 19:23:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:22,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:23:22,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:23:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:22,565 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:23:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:22,613 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-11 19:23:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:23:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:22,615 INFO L225 Difference]: With dead ends: 33 [2024-09-11 19:23:22,615 INFO L226 Difference]: Without dead ends: 30 [2024-09-11 19:23:22,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:23:22,616 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:22,616 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-11 19:23:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-11 19:23:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:23:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-11 19:23:22,628 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2024-09-11 19:23:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:22,629 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-11 19:23:22,629 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:23:22,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-11 19:23:22,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:23:22,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:22,631 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:22,631 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:23:22,631 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:22,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1559087394, now seen corresponding path program 1 times [2024-09-11 19:23:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:22,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228441444] [2024-09-11 19:23:22,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:22,789 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:23:22,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:22,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228441444] [2024-09-11 19:23:22,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228441444] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:22,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:22,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-11 19:23:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87340863] [2024-09-11 19:23:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:22,790 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:23:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:23:22,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:23:22,792 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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:23:22,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:22,846 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-09-11 19:23:22,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:23:22,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 22 [2024-09-11 19:23:22,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:22,849 INFO L225 Difference]: With dead ends: 35 [2024-09-11 19:23:22,849 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 19:23:22,850 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:23:22,850 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:22,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:23:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 19:23:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 19:23:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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:23:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-09-11 19:23:22,858 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2024-09-11 19:23:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:22,858 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-09-11 19:23:22,860 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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:23:22,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-09-11 19:23:22,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 19:23:22,861 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:22,861 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:22,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 19:23:22,862 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:22,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1269351279, now seen corresponding path program 1 times [2024-09-11 19:23:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770485075] [2024-09-11 19:23:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:23,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770485075] [2024-09-11 19:23:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770485075] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:23,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-11 19:23:23,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856560947] [2024-09-11 19:23:23,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:23,013 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 19:23:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 19:23:23,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:23:23,014 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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:23:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:23,080 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-09-11 19:23:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:23:23,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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 24 [2024-09-11 19:23:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:23,085 INFO L225 Difference]: With dead ends: 33 [2024-09-11 19:23:23,085 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 19:23:23,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:23:23,086 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:23,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 19:23:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 19:23:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 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:23:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-09-11 19:23:23,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 24 [2024-09-11 19:23:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:23,095 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-09-11 19:23:23,096 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 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:23:23,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-09-11 19:23:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 19:23:23,097 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:23,097 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:23,097 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-11 19:23:23,097 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:23,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -169292946, now seen corresponding path program 1 times [2024-09-11 19:23:23,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:23,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521723660] [2024-09-11 19:23:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521723660] [2024-09-11 19:23:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521723660] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:23,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172286048] [2024-09-11 19:23:23,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:23,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:23,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:23,263 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:23:23,264 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:23:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:23,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:23:23,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:23,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172286048] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:23,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2024-09-11 19:23:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91607659] [2024-09-11 19:23:23,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:23,674 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 19:23:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:23,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 19:23:23,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-09-11 19:23:23,676 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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:23:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:23,766 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2024-09-11 19:23:23,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-11 19:23:23,766 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 26 [2024-09-11 19:23:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:23,767 INFO L225 Difference]: With dead ends: 57 [2024-09-11 19:23:23,767 INFO L226 Difference]: Without dead ends: 52 [2024-09-11 19:23:23,768 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-09-11 19:23:23,768 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:23,769 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 12 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-11 19:23:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-11 19:23:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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:23:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-09-11 19:23:23,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 26 [2024-09-11 19:23:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:23,776 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-09-11 19:23:23,776 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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:23:23,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-09-11 19:23:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 19:23:23,777 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:23,778 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:23,794 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:23:23,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:23,982 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:23,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1543675830, now seen corresponding path program 2 times [2024-09-11 19:23:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:23,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187264341] [2024-09-11 19:23:23,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:24,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187264341] [2024-09-11 19:23:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187264341] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578230385] [2024-09-11 19:23:24,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:23:24,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:24,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:24,430 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:23:24,431 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:23:24,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:23:24,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:23:24,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-11 19:23:24,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:24,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578230385] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:25,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2024-09-11 19:23:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193250161] [2024-09-11 19:23:25,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:25,419 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-11 19:23:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:25,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-11 19:23:25,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-09-11 19:23:25,421 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 48 states have internal predecessors, (100), 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:23:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:25,606 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2024-09-11 19:23:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-11 19:23:25,606 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 48 states have internal predecessors, (100), 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 50 [2024-09-11 19:23:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:25,607 INFO L225 Difference]: With dead ends: 105 [2024-09-11 19:23:25,607 INFO L226 Difference]: Without dead ends: 100 [2024-09-11 19:23:25,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-09-11 19:23:25,609 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:25,609 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 12 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-11 19:23:25,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-09-11 19:23:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.02020202020202) internal successors, (101), 99 states have internal predecessors, (101), 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:23:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2024-09-11 19:23:25,625 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 50 [2024-09-11 19:23:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:25,625 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2024-09-11 19:23:25,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 48 states have internal predecessors, (100), 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:23:25,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2024-09-11 19:23:25,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-09-11 19:23:25,628 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:25,628 INFO L216 NwaCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:25,649 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:23:25,835 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 19:23:25,836 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:25,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1183511038, now seen corresponding path program 3 times [2024-09-11 19:23:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:25,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949484669] [2024-09-11 19:23:25,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:27,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949484669] [2024-09-11 19:23:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949484669] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768060672] [2024-09-11 19:23:27,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:23:27,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:27,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:27,295 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:23:27,296 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:23:27,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 19:23:27,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:23:27,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:23:27,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2024-09-11 19:23:27,434 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2024-09-11 19:23:27,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768060672] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:27,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:27,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 4, 4] total 53 [2024-09-11 19:23:27,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996336437] [2024-09-11 19:23:27,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:27,534 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-11 19:23:27,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-11 19:23:27,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 19:23:27,537 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 53 states have internal predecessors, (127), 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:23:27,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:27,689 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2024-09-11 19:23:27,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-11 19:23:27,690 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 53 states have internal predecessors, (127), 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 98 [2024-09-11 19:23:27,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:27,691 INFO L225 Difference]: With dead ends: 112 [2024-09-11 19:23:27,691 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 19:23:27,692 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 19:23:27,693 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:27,693 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:27,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 19:23:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-09-11 19:23:27,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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:23:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2024-09-11 19:23:27,705 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 98 [2024-09-11 19:23:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:27,705 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2024-09-11 19:23:27,705 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.3962264150943398) internal successors, (127), 53 states have internal predecessors, (127), 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:23:27,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2024-09-11 19:23:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-09-11 19:23:27,707 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:27,707 INFO L216 NwaCegarLoop]: trace histogram [42, 38, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:27,724 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:23:27,907 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 19:23:27,908 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:27,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2056739021, now seen corresponding path program 4 times [2024-09-11 19:23:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739835537] [2024-09-11 19:23:27,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:27,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:23:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739835537] [2024-09-11 19:23:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739835537] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225288304] [2024-09-11 19:23:29,535 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:23:29,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:29,537 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:23:29,538 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:23:29,611 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:23:29,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:23:29,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-11 19:23:29,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:23:29,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 273 proven. 1482 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:23:30,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225288304] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:30,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:30,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2024-09-11 19:23:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764147259] [2024-09-11 19:23:30,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:30,950 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-11 19:23:30,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:30,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-11 19:23:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 19:23:30,952 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 53 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 52 states have internal predecessors, (129), 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:23:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:31,093 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2024-09-11 19:23:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-11 19:23:31,094 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 52 states have internal predecessors, (129), 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 106 [2024-09-11 19:23:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:31,095 INFO L225 Difference]: With dead ends: 123 [2024-09-11 19:23:31,095 INFO L226 Difference]: Without dead ends: 113 [2024-09-11 19:23:31,096 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 162 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 19:23:31,096 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:31,097 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:23:31,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-11 19:23:31,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-09-11 19:23:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0178571428571428) internal successors, (114), 112 states have internal predecessors, (114), 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:23:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2024-09-11 19:23:31,109 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 106 [2024-09-11 19:23:31,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:31,109 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2024-09-11 19:23:31,110 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.4339622641509435) internal successors, (129), 52 states have internal predecessors, (129), 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:23:31,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2024-09-11 19:23:31,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-09-11 19:23:31,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:31,111 INFO L216 NwaCegarLoop]: trace histogram [45, 41, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:31,129 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 19:23:31,312 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:31,312 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:31,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1786932196, now seen corresponding path program 5 times [2024-09-11 19:23:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:31,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317919295] [2024-09-11 19:23:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:32,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317919295] [2024-09-11 19:23:32,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317919295] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:32,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309168679] [2024-09-11 19:23:32,848 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 19:23:32,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:32,850 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:23:32,851 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:23:32,923 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2024-09-11 19:23:32,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:23:32,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 19:23:32,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2024-09-11 19:23:33,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 484 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2024-09-11 19:23:35,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309168679] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:35,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:35,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 25, 25] total 98 [2024-09-11 19:23:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703341512] [2024-09-11 19:23:35,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:35,067 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2024-09-11 19:23:35,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:35,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2024-09-11 19:23:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2024-09-11 19:23:35,071 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand has 98 states, 98 states have (on average 2.2551020408163267) internal successors, (221), 98 states have internal predecessors, (221), 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:23:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:35,381 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2024-09-11 19:23:35,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-09-11 19:23:35,382 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.2551020408163267) internal successors, (221), 98 states have internal predecessors, (221), 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 112 [2024-09-11 19:23:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:35,383 INFO L225 Difference]: With dead ends: 200 [2024-09-11 19:23:35,383 INFO L226 Difference]: Without dead ends: 197 [2024-09-11 19:23:35,385 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2024-09-11 19:23:35,385 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:35,386 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:35,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-09-11 19:23:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-09-11 19:23:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.010204081632653) internal successors, (198), 196 states have internal predecessors, (198), 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:23:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2024-09-11 19:23:35,398 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 112 [2024-09-11 19:23:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:35,399 INFO L474 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2024-09-11 19:23:35,399 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.2551020408163267) internal successors, (221), 98 states have internal predecessors, (221), 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:23:35,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2024-09-11 19:23:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-09-11 19:23:35,401 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:35,402 INFO L216 NwaCegarLoop]: trace histogram [87, 46, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:35,418 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:23:35,605 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 19:23:35,606 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:35,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1382243944, now seen corresponding path program 6 times [2024-09-11 19:23:35,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:35,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403826810] [2024-09-11 19:23:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:23:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:39,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403826810] [2024-09-11 19:23:39,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403826810] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:39,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134318484] [2024-09-11 19:23:39,862 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 19:23:39,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:39,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:23:39,865 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 19:23:39,994 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 87 check-sat command(s) [2024-09-11 19:23:39,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:23:39,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-11 19:23:39,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-11 19:23:40,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3813 proven. 2116 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-11 19:23:42,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134318484] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:42,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:42,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 49, 49] total 102 [2024-09-11 19:23:42,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326264266] [2024-09-11 19:23:42,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:42,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-09-11 19:23:42,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:42,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-09-11 19:23:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-09-11 19:23:42,491 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand has 102 states, 102 states have (on average 2.215686274509804) internal successors, (226), 102 states have internal predecessors, (226), 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:23:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:42,882 INFO L93 Difference]: Finished difference Result 208 states and 212 transitions. [2024-09-11 19:23:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-09-11 19:23:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 2.215686274509804) internal successors, (226), 102 states have internal predecessors, (226), 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 196 [2024-09-11 19:23:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:42,884 INFO L225 Difference]: With dead ends: 208 [2024-09-11 19:23:42,884 INFO L226 Difference]: Without dead ends: 205 [2024-09-11 19:23:42,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 344 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-09-11 19:23:42,887 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:42,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-09-11 19:23:42,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-09-11 19:23:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 1.0098039215686274) internal successors, (206), 204 states have internal predecessors, (206), 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:23:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2024-09-11 19:23:42,900 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 196 [2024-09-11 19:23:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:42,900 INFO L474 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2024-09-11 19:23:42,901 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 2.215686274509804) internal successors, (226), 102 states have internal predecessors, (226), 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:23:42,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2024-09-11 19:23:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-09-11 19:23:42,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:42,903 INFO L216 NwaCegarLoop]: trace histogram [91, 50, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:42,915 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 19:23:43,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 19:23:43,104 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:43,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -762391728, now seen corresponding path program 7 times [2024-09-11 19:23:43,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:43,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332789866] [2024-09-11 19:23:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:43,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-11 19:23:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332789866] [2024-09-11 19:23:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332789866] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:23:44,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640523327] [2024-09-11 19:23:44,862 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-11 19:23:44,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:23:44,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:23:44,863 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:23:44,864 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 19:23:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:44,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-09-11 19:23:44,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:23:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-11 19:23:45,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:23:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 6559 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-11 19:23:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640523327] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:23:45,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:23:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 54 [2024-09-11 19:23:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052471720] [2024-09-11 19:23:45,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:23:45,478 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-09-11 19:23:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-09-11 19:23:45,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2024-09-11 19:23:45,480 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand has 55 states, 55 states have (on average 2.272727272727273) internal successors, (125), 54 states have internal predecessors, (125), 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:23:46,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:46,482 INFO L93 Difference]: Finished difference Result 211 states and 212 transitions. [2024-09-11 19:23:46,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-11 19:23:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.272727272727273) internal successors, (125), 54 states have internal predecessors, (125), 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 204 [2024-09-11 19:23:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:46,484 INFO L225 Difference]: With dead ends: 211 [2024-09-11 19:23:46,484 INFO L226 Difference]: Without dead ends: 208 [2024-09-11 19:23:46,485 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=2862, Unknown=0, NotChecked=0, Total=2970 [2024-09-11 19:23:46,485 INFO L434 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 3673 mSDsCounter, 0 mSdLazyCounter, 2759 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3745 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:46,486 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3745 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2759 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-11 19:23:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-09-11 19:23:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2024-09-11 19:23:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.0097087378640777) internal successors, (208), 206 states have internal predecessors, (208), 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:23:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2024-09-11 19:23:46,506 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2024-09-11 19:23:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:46,506 INFO L474 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2024-09-11 19:23:46,506 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.272727272727273) internal successors, (125), 54 states have internal predecessors, (125), 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:23:46,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2024-09-11 19:23:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-09-11 19:23:46,508 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:23:46,509 INFO L216 NwaCegarLoop]: trace histogram [92, 51, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:46,526 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 19:23:46,712 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 19:23:46,713 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:23:46,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1773418570, now seen corresponding path program 8 times [2024-09-11 19:23:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:23:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083540536] [2024-09-11 19:23:46,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:23:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:23:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:23:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 6742 proven. 0 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2024-09-11 19:23:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:23:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083540536] [2024-09-11 19:23:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083540536] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:23:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:23:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2024-09-11 19:23:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926419792] [2024-09-11 19:23:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:23:48,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-11 19:23:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:23:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-11 19:23:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-11 19:23:48,302 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 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:23:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:23:48,570 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2024-09-11 19:23:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-11 19:23:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 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 206 [2024-09-11 19:23:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:23:48,572 INFO L225 Difference]: With dead ends: 207 [2024-09-11 19:23:48,572 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:23:48,573 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2024-09-11 19:23:48,573 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:23:48,574 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:23:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:23:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:23:48,575 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:23:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:23:48,575 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2024-09-11 19:23:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:23:48,575 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:23:48,576 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 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:23:48,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:23:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:23:48,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:23:48,579 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:23:48,579 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-11 19:23:48,582 INFO L408 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:23:48,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:23:50,578 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:23:50,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:23:50 BoogieIcfgContainer [2024-09-11 19:23:50,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:23:50,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:23:50,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:23:50,609 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:23:50,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:23:21" (3/4) ... [2024-09-11 19:23:50,611 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:23:50,621 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-11 19:23:50,622 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 19:23:50,622 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:23:50,622 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:23:50,706 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:23:50,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:23:50,707 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:23:50,708 INFO L158 Benchmark]: Toolchain (without parser) took 30362.18ms. Allocated memory was 178.3MB in the beginning and 320.9MB in the end (delta: 142.6MB). Free memory was 122.7MB in the beginning and 155.7MB in the end (delta: -32.9MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:50,708 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 178.3MB. Free memory was 143.2MB in the beginning and 142.9MB in the end (delta: 277.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:50,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.08ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 110.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 19:23:50,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.70ms. Allocated memory is still 178.3MB. Free memory was 110.1MB in the beginning and 108.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:23:50,709 INFO L158 Benchmark]: Boogie Preprocessor took 47.11ms. Allocated memory is still 178.3MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:23:50,709 INFO L158 Benchmark]: RCFGBuilder took 363.95ms. Allocated memory is still 178.3MB. Free memory was 106.4MB in the beginning and 92.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-11 19:23:50,709 INFO L158 Benchmark]: TraceAbstraction took 29555.86ms. Allocated memory was 178.3MB in the beginning and 320.9MB in the end (delta: 142.6MB). Free memory was 91.3MB in the beginning and 162.0MB in the end (delta: -70.7MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2024-09-11 19:23:50,710 INFO L158 Benchmark]: Witness Printer took 98.38ms. Allocated memory is still 320.9MB. Free memory was 160.9MB in the beginning and 155.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 19:23:50,711 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.21ms. Allocated memory is still 178.3MB. Free memory was 143.2MB in the beginning and 142.9MB in the end (delta: 277.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.08ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 110.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.70ms. Allocated memory is still 178.3MB. Free memory was 110.1MB in the beginning and 108.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.11ms. Allocated memory is still 178.3MB. Free memory was 108.5MB in the beginning and 106.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 363.95ms. Allocated memory is still 178.3MB. Free memory was 106.4MB in the beginning and 92.2MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29555.86ms. Allocated memory was 178.3MB in the beginning and 320.9MB in the end (delta: 142.6MB). Free memory was 91.3MB in the beginning and 162.0MB in the end (delta: -70.7MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. * Witness Printer took 98.38ms. Allocated memory is still 320.9MB. Free memory was 160.9MB in the beginning and 155.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 96]: 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, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 16, TraceHistogramMax: 92, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 4015 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3768 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4703 IncrementalHoareTripleChecker+Invalid, 4852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 247 mSDtfsCounter, 4703 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2006 GetRequests, 1410 SyntacticMatches, 91 SemanticMatches, 505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2521 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=15, InterpolantAutomatonStates: 533, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.3s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1896 NumberOfCodeBlocksAsserted, 159 NumberOfCheckSat, 2730 ConstructedInterpolants, 0 QuantifiedInterpolants, 6615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1857 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 31437/72314 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: 72]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main__y == 83) && (main__x == 83)) || ((51 == main__x) && (51 == main__y))) || ((84 == main__x) && (84 == main__y))) || ((77 == main__x) && (77 == main__y))) || ((main__y == 100) && (100 <= main__x))) || ((76 == main__x) && (76 == main__y))) || ((71 == main__x) && (71 == main__y))) || ((57 == main__y) && (57 == main__x))) || ((main__x == 70) && (main__y == 70))) || ((main__x == 65) && (main__y == 65))) || ((53 == main__y) && (53 == main__x))) || ((72 == main__y) && (72 == main__x))) || ((67 == main__x) && (67 == main__y))) || ((main__x == 74) && (main__y == 74))) || ((main__y == 54) && (main__x == 54))) || ((98 == main__x) && (98 == main__y))) || ((main__y == 90) && (main__x == 90))) || ((main__y == 82) && (main__x == 82))) || ((main__y == 63) && (main__x == 63))) || ((main__x == 80) && (main__y == 80))) || ((main__y == 93) && (main__x == 93))) || ((main__y == 85) && (main__x == 85))) || ((main__x <= 50) && (main__y == 50))) || ((main__y == 61) && (main__x == 61))) || ((main__x == 60) && (main__y == 60))) || ((94 == main__x) && (94 == main__y))) || ((81 == main__x) && (81 == main__y))) || ((main__y == 73) && (main__x == 73))) || ((68 == main__y) && (68 == main__x))) || ((main__y == 79) && (main__x == 79))) || ((main__x == 58) && (main__y == 58))) || ((95 == main__y) && (95 == main__x))) || ((main__y == 78) && (main__x == 78))) || ((66 == main__y) && (66 == main__x))) || ((52 == main__x) && (52 == main__y))) || ((69 == main__x) && (69 == main__y))) || ((main__x == 99) && (main__y == 99))) || ((87 == main__x) && (87 == main__y))) || ((main__x == 75) && (main__y == 75))) || ((97 == main__y) && (97 == main__x))) || ((56 == main__y) && (56 == main__x))) || ((main__x == 86) && (main__y == 86))) || ((88 == main__x) && (88 == main__y))) || ((91 == main__x) && (91 == main__y))) || ((59 == main__x) && (59 == main__y))) || ((62 == main__x) && (62 == main__y))) || ((main__y == 89) && (main__x == 89))) || ((main__x == 55) && (main__y == 55))) || ((main__x == 96) && (main__y == 96))) || ((64 == main__x) && (64 == main__y))) || ((92 == main__y) && (92 == main__x))) - InvariantResult [Line: 13]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 35]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x <= 3)) - InvariantResult [Line: 47]: Location Invariant Derived location invariant: ((main__x <= 5) && (main__y == 50)) - InvariantResult [Line: 65]: Location Invariant Derived location invariant: ((main__x <= 8) && (main__y == 50)) - InvariantResult [Line: 29]: Location Invariant Derived location invariant: ((main__x <= 2) && (main__y == 50)) - InvariantResult [Line: 41]: Location Invariant Derived location invariant: ((main__x <= 4) && (main__y == 50)) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x <= 7)) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x <= 1)) - InvariantResult [Line: 53]: Location Invariant Derived location invariant: ((main__y == 50) && (main__x <= 6)) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:23:50,736 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE