./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/phases_1-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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-acceleration/phases_1-1.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 bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:14:27,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:14:27,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:14:27,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:14:27,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:14:27,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:14:27,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:14:27,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:14:27,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:14:27,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:14:27,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:14:27,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:14:27,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:14:27,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:14:27,516 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:14:27,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:14:27,516 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:14:27,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:14:27,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:14:27,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:14:27,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:14:27,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:14:27,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:14:27,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:14:27,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:14:27,518 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:14:27,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:14:27,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:14:27,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:14:27,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:14:27,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:14:27,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:14:27,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:14:27,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:14:27,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:14:27,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:14:27,522 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 -> bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:14:27,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:14:27,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:14:27,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:14:27,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:14:27,805 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:14:27,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2024-09-12 21:14:29,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:14:29,366 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:14:29,366 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2024-09-12 21:14:29,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/571a7ce34/199c54bb6ca247e5a4fa94ae3a1971a3/FLAG8af60b952 [2024-09-12 21:14:29,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/571a7ce34/199c54bb6ca247e5a4fa94ae3a1971a3 [2024-09-12 21:14:29,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:14:29,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:14:29,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:14:29,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:14:29,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:14:29,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452d279b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29, skipping insertion in model container [2024-09-12 21:14:29,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:14:29,561 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-acceleration/phases_1-1.c[322,335] [2024-09-12 21:14:29,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:14:29,588 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:14:29,601 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-acceleration/phases_1-1.c[322,335] [2024-09-12 21:14:29,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:14:29,624 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:14:29,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29 WrapperNode [2024-09-12 21:14:29,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:14:29,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:14:29,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:14:29,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:14:29,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,647 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:14:29,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:14:29,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:14:29,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:14:29,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:14:29,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,672 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 21:14:29,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,679 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:14:29,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:14:29,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:14:29,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:14:29,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (1/1) ... [2024-09-12 21:14:29,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:14:29,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:29,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:14:29,733 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:14:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:14:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:14:29,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:14:29,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:14:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:14:29,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:14:29,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:14:29,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:14:29,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:14:29,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:14:29,845 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:14:29,848 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:14:29,997 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-12 21:14:29,997 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:14:30,030 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:14:30,031 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 21:14:30,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:14:30 BoogieIcfgContainer [2024-09-12 21:14:30,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:14:30,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:14:30,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:14:30,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:14:30,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:14:29" (1/3) ... [2024-09-12 21:14:30,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e110703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:14:30, skipping insertion in model container [2024-09-12 21:14:30,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:14:29" (2/3) ... [2024-09-12 21:14:30,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e110703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:14:30, skipping insertion in model container [2024-09-12 21:14:30,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:14:30" (3/3) ... [2024-09-12 21:14:30,081 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2024-09-12 21:14:30,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:14:30,112 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:14:30,175 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:14:30,184 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;@22a500ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:14:30,184 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:14:30,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 21:14:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:14:30,196 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:30,196 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:30,197 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:30,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1330752012, now seen corresponding path program 1 times [2024-09-12 21:14:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274101539] [2024-09-12 21:14:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:30,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:30,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274101539] [2024-09-12 21:14:30,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274101539] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:14:30,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:14:30,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 21:14:30,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929992190] [2024-09-12 21:14:30,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:14:30,347 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 21:14:30,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 21:14:30,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:14:30,373 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:30,391 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 21:14:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 21:14:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:14:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:30,399 INFO L225 Difference]: With dead ends: 29 [2024-09-12 21:14:30,399 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 21:14:30,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:14:30,406 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:30,407 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:14:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 21:14:30,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 21:14:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 21:14:30,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 21:14:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:30,434 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 21:14:30,434 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 21:14:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:14:30,436 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:30,436 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:30,436 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:14:30,436 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:30,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1321516802, now seen corresponding path program 1 times [2024-09-12 21:14:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:30,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469809107] [2024-09-12 21:14:30,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:30,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:30,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469809107] [2024-09-12 21:14:30,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469809107] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:14:30,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:14:30,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:14:30,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102932655] [2024-09-12 21:14:30,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:14:30,581 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:14:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:14:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:14:30,582 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:30,616 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-12 21:14:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:14:30,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:14:30,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:30,617 INFO L225 Difference]: With dead ends: 21 [2024-09-12 21:14:30,617 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 21:14:30,618 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:14:30,619 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:30,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:14:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 21:14:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-12 21:14:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-09-12 21:14:30,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-09-12 21:14:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:30,624 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-09-12 21:14:30,624 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-09-12 21:14:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:14:30,626 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:30,626 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:30,626 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:14:30,626 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:30,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -257340833, now seen corresponding path program 1 times [2024-09-12 21:14:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937052350] [2024-09-12 21:14:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:30,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:30,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937052350] [2024-09-12 21:14:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937052350] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183923037] [2024-09-12 21:14:30,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:30,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:30,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:30,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:30,770 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 21:14:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:30,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 21:14:30,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:30,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183923037] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:30,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 21:14:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286777580] [2024-09-12 21:14:30,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:30,916 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:14:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:30,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:14:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:14:30,917 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:30,984 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-12 21:14:30,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 21:14:30,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 21:14:30,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:30,988 INFO L225 Difference]: With dead ends: 25 [2024-09-12 21:14:30,988 INFO L226 Difference]: Without dead ends: 18 [2024-09-12 21:14:30,988 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:14:30,989 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:30,990 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:14:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-12 21:14:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-09-12 21:14:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-12 21:14:31,000 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-09-12 21:14:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:31,000 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-12 21:14:31,001 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:31,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-12 21:14:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 21:14:31,002 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:31,002 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:31,014 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 21:14:31,202 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:31,203 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:31,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1791473815, now seen corresponding path program 1 times [2024-09-12 21:14:31,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:31,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628010434] [2024-09-12 21:14:31,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:31,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:31,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:31,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628010434] [2024-09-12 21:14:31,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628010434] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:31,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593207915] [2024-09-12 21:14:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:31,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:31,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:31,352 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 21:14:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:31,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 21:14:31,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:31,471 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:31,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 21:14:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593207915] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:31,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-09-12 21:14:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708790652] [2024-09-12 21:14:31,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:31,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 21:14:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:31,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 21:14:31,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-12 21:14:31,571 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:31,673 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-09-12 21:14:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 21:14:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 21:14:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:31,674 INFO L225 Difference]: With dead ends: 33 [2024-09-12 21:14:31,674 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 21:14:31,674 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-12 21:14:31,677 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:31,679 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:14:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 21:14:31,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-09-12 21:14:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-09-12 21:14:31,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2024-09-12 21:14:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:31,694 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-09-12 21:14:31,694 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:31,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-09-12 21:14:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 21:14:31,695 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:31,696 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:31,716 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 21:14:31,896 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:31,897 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:31,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1266387508, now seen corresponding path program 2 times [2024-09-12 21:14:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036888699] [2024-09-12 21:14:31,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:32,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:32,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036888699] [2024-09-12 21:14:32,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036888699] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:32,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943664402] [2024-09-12 21:14:32,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:14:32,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:32,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:32,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:32,128 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 21:14:32,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:14:32,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:14:32,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 21:14:32,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:32,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:32,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943664402] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:32,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:32,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-12 21:14:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076539679] [2024-09-12 21:14:32,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:32,316 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 21:14:32,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 21:14:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-09-12 21:14:32,317 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:32,474 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-12 21:14:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 21:14:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 21:14:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:32,477 INFO L225 Difference]: With dead ends: 42 [2024-09-12 21:14:32,477 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 21:14:32,477 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2024-09-12 21:14:32,478 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:32,479 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:14:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 21:14:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-09-12 21:14:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-12 21:14:32,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-09-12 21:14:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:32,491 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-12 21:14:32,491 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:32,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-12 21:14:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 21:14:32,493 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:32,493 INFO L216 NwaCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:32,509 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 21:14:32,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:32,694 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:32,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1613671460, now seen corresponding path program 3 times [2024-09-12 21:14:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:32,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199528315] [2024-09-12 21:14:32,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:32,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:32,840 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 21:14:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199528315] [2024-09-12 21:14:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199528315] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:32,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626059021] [2024-09-12 21:14:32,841 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 21:14:32,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:32,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:32,843 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:32,845 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 21:14:32,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-09-12 21:14:32,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:14:32,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 21:14:32,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-12 21:14:32,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-12 21:14:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626059021] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:33,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-09-12 21:14:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228482547] [2024-09-12 21:14:33,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:33,104 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 21:14:33,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 21:14:33,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-09-12 21:14:33,105 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:37,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:14:41,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:14:45,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:14:49,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:14:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:49,672 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-09-12 21:14:49,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 21:14:49,673 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-09-12 21:14:49,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:49,674 INFO L225 Difference]: With dead ends: 94 [2024-09-12 21:14:49,674 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 21:14:49,675 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2024-09-12 21:14:49,676 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:49,677 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-09-12 21:14:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 21:14:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 41. [2024-09-12 21:14:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-09-12 21:14:49,702 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 26 [2024-09-12 21:14:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:49,703 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-09-12 21:14:49,703 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:49,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-09-12 21:14:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 21:14:49,705 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:49,705 INFO L216 NwaCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:49,722 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 21:14:49,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:49,910 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:49,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash 644275237, now seen corresponding path program 4 times [2024-09-12 21:14:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:49,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725787795] [2024-09-12 21:14:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:50,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 21:14:50,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725787795] [2024-09-12 21:14:50,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725787795] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:50,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598280465] [2024-09-12 21:14:50,109 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 21:14:50,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:50,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:50,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:50,112 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 21:14:50,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 21:14:50,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:14:50,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 21:14:50,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 117 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 21:14:50,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 117 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 21:14:50,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598280465] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:50,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 22 [2024-09-12 21:14:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22281950] [2024-09-12 21:14:50,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:50,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 21:14:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 21:14:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2024-09-12 21:14:50,615 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:52,819 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2024-09-12 21:14:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-12 21:14:52,819 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-12 21:14:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:52,820 INFO L225 Difference]: With dead ends: 87 [2024-09-12 21:14:52,820 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 21:14:52,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=348, Invalid=582, Unknown=0, NotChecked=0, Total=930 [2024-09-12 21:14:52,823 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:52,823 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:14:52,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 21:14:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-12 21:14:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:52,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-09-12 21:14:52,851 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 40 [2024-09-12 21:14:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:52,852 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-09-12 21:14:52,852 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:52,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-09-12 21:14:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-12 21:14:52,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:52,854 INFO L216 NwaCegarLoop]: trace histogram [25, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:52,870 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 21:14:53,054 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 21:14:53,055 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:53,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash -779631609, now seen corresponding path program 5 times [2024-09-12 21:14:53,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:53,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101059442] [2024-09-12 21:14:53,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:53,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:53,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 21:14:53,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101059442] [2024-09-12 21:14:53,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101059442] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:53,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196076197] [2024-09-12 21:14:53,548 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 21:14:53,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:53,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:53,549 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:53,550 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 21:14:53,634 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2024-09-12 21:14:53,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:14:53,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-12 21:14:53,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 21:14:53,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:54,977 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 21:14:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196076197] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:54,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 25] total 48 [2024-09-12 21:14:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724384846] [2024-09-12 21:14:54,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:54,978 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-12 21:14:54,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:54,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-12 21:14:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=1615, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 21:14:54,980 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:16:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:16:13,750 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2024-09-12 21:16:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-12 21:16:13,750 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2024-09-12 21:16:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:16:13,751 INFO L225 Difference]: With dead ends: 133 [2024-09-12 21:16:13,751 INFO L226 Difference]: Without dead ends: 109 [2024-09-12 21:16:13,753 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 79.3s TimeCoverageRelationStatistics Valid=1697, Invalid=3133, Unknown=0, NotChecked=0, Total=4830 [2024-09-12 21:16:13,754 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 21:16:13,754 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 21:16:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-12 21:16:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-09-12 21:16:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 104 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:16:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-09-12 21:16:13,793 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 60 [2024-09-12 21:16:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:16:13,794 INFO L474 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-09-12 21:16:13,794 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:16:13,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:16:13,795 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-09-12 21:16:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-09-12 21:16:13,797 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:16:13,797 INFO L216 NwaCegarLoop]: trace histogram [49, 41, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:16:13,812 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 21:16:13,997 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:16:13,998 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:16:13,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:16:13,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1803417023, now seen corresponding path program 6 times [2024-09-12 21:16:13,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:16:13,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177382817] [2024-09-12 21:16:13,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:16:13,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:16:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:16:15,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:16:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:16:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 630 proven. 1722 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 21:16:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:16:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177382817] [2024-09-12 21:16:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177382817] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:16:15,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139962068] [2024-09-12 21:16:15,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 21:16:15,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:16:15,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:16:15,662 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-12 21:16:15,663 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-12 21:16:16,141 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2024-09-12 21:16:16,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:16:16,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 21:16:16,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:16:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 697 proven. 64 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-12 21:16:16,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:16:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 697 proven. 64 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-12 21:16:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139962068] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:16:17,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:16:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 11, 11] total 62 [2024-09-12 21:16:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967334201] [2024-09-12 21:16:17,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:16:17,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-09-12 21:16:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:16:17,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-09-12 21:16:17,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=909, Invalid=2873, Unknown=0, NotChecked=0, Total=3782 [2024-09-12 21:16:17,060 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:16:24,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:28,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:32,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:36,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:40,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:44,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:48,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:53,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:16:57,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:01,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:05,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:09,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:13,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:17,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:21,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:25,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:29,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:33,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:37,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:42,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:46,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:50,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:54,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:17:58,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:01,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:05,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:09,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:13,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:17,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:21,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:25,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:29,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:33,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:37,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:41,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:45,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:49,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:54,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:18:58,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:02,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:06,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:10,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:14,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:18,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:22,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:26,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:30,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:34,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:38,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:42,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:46,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:50,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:54,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:19:59,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:03,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:07,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:11,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:15,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:19,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:23,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:27,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:32,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:36,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:40,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:44,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:49,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:53,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:20:57,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:21:01,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 21:21:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:21:02,447 INFO L93 Difference]: Finished difference Result 312 states and 429 transitions. [2024-09-12 21:21:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-09-12 21:21:02,448 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2024-09-12 21:21:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:21:02,450 INFO L225 Difference]: With dead ends: 312 [2024-09-12 21:21:02,450 INFO L226 Difference]: Without dead ends: 288 [2024-09-12 21:21:02,453 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=3246, Invalid=6854, Unknown=0, NotChecked=0, Total=10100 [2024-09-12 21:21:02,454 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2916 mSolverCounterSat, 123 mSolverCounterUnsat, 68 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 276.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2916 IncrementalHoareTripleChecker+Invalid, 68 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 276.7s IncrementalHoareTripleChecker+Time [2024-09-12 21:21:02,454 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 72 Invalid, 3107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2916 Invalid, 68 Unknown, 0 Unchecked, 276.7s Time] [2024-09-12 21:21:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-09-12 21:21:02,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 133. [2024-09-12 21:21:02,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.15625) internal successors, (148), 128 states have internal predecessors, (148), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:21:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 152 transitions. [2024-09-12 21:21:02,510 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 152 transitions. Word has length 108 [2024-09-12 21:21:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:21:02,511 INFO L474 AbstractCegarLoop]: Abstraction has 133 states and 152 transitions. [2024-09-12 21:21:02,511 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:21:02,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:21:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2024-09-12 21:21:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-12 21:21:02,513 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:21:02,513 INFO L216 NwaCegarLoop]: trace histogram [61, 43, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:21:02,531 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-12 21:21:02,714 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:21:02,714 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:21:02,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:21:02,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1713079175, now seen corresponding path program 7 times [2024-09-12 21:21:02,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:21:02,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931844097] [2024-09-12 21:21:02,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:21:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:21:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:21:04,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:21:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:21:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1540 proven. 1892 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2024-09-12 21:21:04,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:21:04,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931844097] [2024-09-12 21:21:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931844097] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:21:04,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110020573] [2024-09-12 21:21:04,533 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 21:21:04,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:21:04,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:21:04,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:21:04,535 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-12 21:21:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:21:04,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-09-12 21:21:04,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:21:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 180 proven. 3540 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:21:05,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:21:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 180 proven. 3540 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 21:21:13,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110020573] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:21:13,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:21:13,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 62, 63] total 124 [2024-09-12 21:21:13,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829607034] [2024-09-12 21:21:13,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:21:13,796 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2024-09-12 21:21:13,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:21:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2024-09-12 21:21:13,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4011, Invalid=11241, Unknown=0, NotChecked=0, Total=15252 [2024-09-12 21:21:13,800 INFO L87 Difference]: Start difference. First operand 133 states and 152 transitions. Second operand has 124 states, 124 states have (on average 2.032258064516129) internal successors, (252), 124 states have internal predecessors, (252), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:21:20,307 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ 35 c_main_~x~0) 4294967296))) (or (< 268435454 .cse0) (< .cse0 65520))) (let ((.cse1 (mod (+ 58 c_main_~x~0) 4294967296))) (or (< 268435454 .cse1) (< .cse1 65520))) (let ((.cse2 (mod (+ 49 c_main_~x~0) 4294967296))) (or (< 268435454 .cse2) (< .cse2 65520))) (let ((.cse3 (mod (+ 73 c_main_~x~0) 4294967296))) (or (< 268435454 .cse3) (< .cse3 65520))) (let ((.cse4 (mod (+ 36 c_main_~x~0) 4294967296))) (or (< .cse4 65520) (< 268435454 .cse4))) (let ((.cse5 (mod (+ 52 c_main_~x~0) 4294967296))) (or (< .cse5 65520) (< 268435454 .cse5))) (let ((.cse6 (mod (+ 69 c_main_~x~0) 4294967296))) (or (< 268435454 .cse6) (< .cse6 65520))) (< (mod c_main_~x~0 4294967296) 65520) (let ((.cse7 (mod (+ 48 c_main_~x~0) 4294967296))) (or (< .cse7 65520) (< 268435454 .cse7))) (let ((.cse8 (mod (+ 47 c_main_~x~0) 4294967296))) (or (< .cse8 65520) (< 268435454 .cse8))) (let ((.cse9 (mod (+ 72 c_main_~x~0) 4294967296))) (or (< .cse9 65520) (< 268435454 .cse9))) (let ((.cse10 (mod (+ 46 c_main_~x~0) 4294967296))) (or (< 268435454 .cse10) (< .cse10 65520))) (let ((.cse11 (mod (+ 33 c_main_~x~0) 4294967296))) (or (< 268435454 .cse11) (< .cse11 65520))) (let ((.cse12 (mod (+ c_main_~x~0 37) 4294967296))) (or (< 268435454 .cse12) (< .cse12 65520))) (let ((.cse13 (mod (+ 14 c_main_~x~0) 4294967296))) (or (< 268435454 .cse13) (< .cse13 65520))) (let ((.cse14 (mod (+ 26 c_main_~x~0) 4294967296))) (or (< 268435454 .cse14) (< .cse14 65520))) (let ((.cse15 (mod (+ 67 c_main_~x~0) 4294967296))) (or (< 268435454 .cse15) (< .cse15 65520))) (let ((.cse16 (mod (+ 2 c_main_~x~0) 4294967296))) (or (< 268435454 .cse16) (< .cse16 65520))) (let ((.cse17 (mod (+ c_main_~x~0 75) 4294967296))) (or (< .cse17 65520) (< 268435454 .cse17))) (let ((.cse18 (mod (+ 38 c_main_~x~0) 4294967296))) (or (< 268435454 .cse18) (< .cse18 65520))) (let ((.cse19 (mod (+ 39 c_main_~x~0) 4294967296))) (or (< .cse19 65520) (< 268435454 .cse19))) (let ((.cse20 (mod (+ 32 c_main_~x~0) 4294967296))) (or (< .cse20 65520) (< 268435454 .cse20))) (let ((.cse21 (mod (+ 8 c_main_~x~0) 4294967296))) (or (< .cse21 65520) (< 268435454 .cse21))) (let ((.cse22 (mod (+ 59 c_main_~x~0) 4294967296))) (or (< 268435454 .cse22) (< .cse22 65520))) (let ((.cse23 (mod (+ 68 c_main_~x~0) 4294967296))) (or (< .cse23 65520) (< 268435454 .cse23))) (let ((.cse24 (mod (+ 71 c_main_~x~0) 4294967296))) (or (< 268435454 .cse24) (< .cse24 65520))) (let ((.cse25 (mod (+ 56 c_main_~x~0) 4294967296))) (or (< 268435454 .cse25) (< .cse25 65520))) (let ((.cse26 (mod (+ 4 c_main_~x~0) 4294967296))) (or (< .cse26 65520) (< 268435454 .cse26))) (let ((.cse27 (mod (+ 20 c_main_~x~0) 4294967296))) (or (< 268435454 .cse27) (< .cse27 65520))) (let ((.cse28 (mod (+ 16 c_main_~x~0) 4294967296))) (or (< .cse28 65520) (< 268435454 .cse28))) (let ((.cse29 (mod (+ 63 c_main_~x~0) 4294967296))) (or (< 268435454 .cse29) (< .cse29 65520))) (let ((.cse30 (mod (+ 44 c_main_~x~0) 4294967296))) (or (< 268435454 .cse30) (< .cse30 65520))) (let ((.cse31 (mod (+ 51 c_main_~x~0) 4294967296))) (or (< 268435454 .cse31) (< .cse31 65520))) (let ((.cse32 (mod (+ 62 c_main_~x~0) 4294967296))) (or (< .cse32 65520) (< 268435454 .cse32))) (let ((.cse33 (mod (+ c_main_~x~0 61) 4294967296))) (or (< 268435454 .cse33) (< .cse33 65520))) (let ((.cse34 (mod (+ 40 c_main_~x~0) 4294967296))) (or (< .cse34 65520) (< 268435454 .cse34))) (let ((.cse35 (mod (+ c_main_~x~0 24) 4294967296))) (or (< 268435454 .cse35) (< .cse35 65520))) (let ((.cse36 (mod (+ 55 c_main_~x~0) 4294967296))) (or (< 268435454 .cse36) (< .cse36 65520))) (let ((.cse37 (mod (+ 18 c_main_~x~0) 4294967296))) (or (< .cse37 65520) (< 268435454 .cse37))) (let ((.cse38 (mod (+ 30 c_main_~x~0) 4294967296))) (or (< 268435454 .cse38) (< .cse38 65520))) (let ((.cse39 (mod (+ 41 c_main_~x~0) 4294967296))) (or (< 268435454 .cse39) (< .cse39 65520))) (let ((.cse40 (mod (+ 45 c_main_~x~0) 4294967296))) (or (< 268435454 .cse40) (< .cse40 65520))) (let ((.cse41 (mod (+ 74 c_main_~x~0) 4294967296))) (or (< .cse41 65520) (< 268435454 .cse41))) (let ((.cse42 (mod (+ 34 c_main_~x~0) 4294967296))) (or (< 268435454 .cse42) (< .cse42 65520))) (let ((.cse43 (mod (+ 70 c_main_~x~0) 4294967296))) (or (< .cse43 65520) (< 268435454 .cse43))) (let ((.cse44 (mod (+ 6 c_main_~x~0) 4294967296))) (or (< 268435454 .cse44) (< .cse44 65520))) (let ((.cse45 (mod (+ 12 c_main_~x~0) 4294967296))) (or (< .cse45 65520) (< 268435454 .cse45))) (let ((.cse46 (mod (+ 57 c_main_~x~0) 4294967296))) (or (< 268435454 .cse46) (< .cse46 65520))) (let ((.cse47 (mod (+ c_main_~x~0 50) 4294967296))) (or (< 268435454 .cse47) (< .cse47 65520))) (let ((.cse48 (mod (+ 42 c_main_~x~0) 4294967296))) (or (< .cse48 65520) (< 268435454 .cse48))) (let ((.cse49 (mod (+ 64 c_main_~x~0) 4294967296))) (or (< .cse49 65520) (< 268435454 .cse49))) (let ((.cse50 (mod (+ c_main_~x~0 54) 4294967296))) (or (< .cse50 65520) (< 268435454 .cse50))) (let ((.cse51 (mod (+ 28 c_main_~x~0) 4294967296))) (or (< .cse51 65520) (< 268435454 .cse51))) (let ((.cse52 (mod (+ 65 c_main_~x~0) 4294967296))) (or (< .cse52 65520) (< 268435454 .cse52))) (let ((.cse53 (mod (+ 53 c_main_~x~0) 4294967296))) (or (< .cse53 65520) (< 268435454 .cse53))) (let ((.cse54 (mod (+ 43 c_main_~x~0) 4294967296))) (or (< 268435454 .cse54) (< .cse54 65520))) (let ((.cse55 (mod (+ 60 c_main_~x~0) 4294967296))) (or (< 268435454 .cse55) (< .cse55 65520))) (let ((.cse56 (mod (+ 66 c_main_~x~0) 4294967296))) (or (< .cse56 65520) (< 268435454 .cse56))) (let ((.cse57 (mod (+ 22 c_main_~x~0) 4294967296))) (or (< 268435454 .cse57) (< .cse57 65520))) (let ((.cse58 (mod (+ 10 c_main_~x~0) 4294967296))) (or (< .cse58 65520) (< 268435454 .cse58)))) is different from false [2024-09-12 21:23:41,405 WARN L293 SmtUtils]: Spent 34.89s on a formula simplification. DAG size of input: 263 DAG size of output: 17 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 21:28:00,605 WARN L293 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 349 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15