./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i -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 67e1f0759ae3eef1dbaa6f8b0d73161640ce69ba156f9f744d71e8aa9cf95f87 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:50:09,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:50:09,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:50:09,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:50:09,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:50:09,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:50:09,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:50:09,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:50:09,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:50:09,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:50:09,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:50:09,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:50:09,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:50:09,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:50:09,501 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:50:09,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:50:09,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:50:09,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:50:09,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:50:09,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:50:09,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:50:09,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:50:09,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:50:09,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:50:09,504 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:50:09,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:50:09,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:50:09,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:50:09,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:50:09,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:50:09,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:50:09,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:50:09,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:50:09,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:50:09,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:50:09,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:50:09,508 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 -> 67e1f0759ae3eef1dbaa6f8b0d73161640ce69ba156f9f744d71e8aa9cf95f87 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:50:09,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:50:09,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:50:09,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:50:09,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:50:09,747 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:50:09,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i [2024-09-11 19:50:10,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:50:11,139 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:50:11,140 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_valuebound20.i [2024-09-11 19:50:11,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b9993fab7/77a57c25da204ea3ac751b4583688be9/FLAG0da5c2295 [2024-09-11 19:50:11,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b9993fab7/77a57c25da204ea3ac751b4583688be9 [2024-09-11 19:50:11,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:50:11,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:50:11,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:50:11,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:50:11,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:50:11,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316bce65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11, skipping insertion in model container [2024-09-11 19:50:11,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:50:11,693 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/nla-digbench-scaling/divbin_valuebound20.i[950,963] [2024-09-11 19:50:11,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:50:11,720 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:50:11,729 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/nla-digbench-scaling/divbin_valuebound20.i[950,963] [2024-09-11 19:50:11,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:50:11,751 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:50:11,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11 WrapperNode [2024-09-11 19:50:11,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:50:11,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:50:11,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:50:11,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:50:11,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,779 INFO L138 Inliner]: procedures = 16, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-09-11 19:50:11,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:50:11,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:50:11,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:50:11,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:50:11,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,806 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:50:11,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:50:11,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:50:11,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:50:11,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:50:11,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (1/1) ... [2024-09-11 19:50:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:50:11,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:11,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:50:11,848 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:50:11,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:50:11,886 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:50:11,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:50:11,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:50:11,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:50:11,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:50:11,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:50:11,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:50:11,938 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:50:11,940 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:50:12,073 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:50:12,074 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:50:12,096 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:50:12,096 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:50:12,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:50:12 BoogieIcfgContainer [2024-09-11 19:50:12,096 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:50:12,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:50:12,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:50:12,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:50:12,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:50:11" (1/3) ... [2024-09-11 19:50:12,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6be5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:50:12, skipping insertion in model container [2024-09-11 19:50:12,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:50:11" (2/3) ... [2024-09-11 19:50:12,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b6be5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:50:12, skipping insertion in model container [2024-09-11 19:50:12,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:50:12" (3/3) ... [2024-09-11 19:50:12,108 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_valuebound20.i [2024-09-11 19:50:12,122 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:50:12,123 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:50:12,175 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:50:12,180 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;@2f9bc6dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:50:12,181 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:50:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:50:12,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 19:50:12,190 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:12,191 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:12,191 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:12,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1335240993, now seen corresponding path program 1 times [2024-09-11 19:50:12,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936415839] [2024-09-11 19:50:12,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:12,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:50:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:12,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:50:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:12,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:50:12,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:12,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:50:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:50:12,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:12,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936415839] [2024-09-11 19:50:12,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936415839] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:50:12,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:50:12,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:50:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354683718] [2024-09-11 19:50:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:50:12,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:50:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:50:12,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:50:12,380 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:50:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:12,404 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2024-09-11 19:50:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:50:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-11 19:50:12,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:12,411 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:50:12,411 INFO L226 Difference]: Without dead ends: 24 [2024-09-11 19:50:12,414 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:50:12,416 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:12,417 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:50:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-11 19:50:12,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-11 19:50:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:50:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-09-11 19:50:12,443 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2024-09-11 19:50:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:12,443 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-09-11 19:50:12,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:50:12,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-09-11 19:50:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:50:12,445 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:12,445 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:12,445 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:50:12,446 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:12,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1249624970, now seen corresponding path program 1 times [2024-09-11 19:50:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:12,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370978978] [2024-09-11 19:50:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:12,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:50:12,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68456937] [2024-09-11 19:50:12,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:12,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:12,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:12,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:50:12,514 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:50:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:12,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 19:50:12,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:50:12,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:50:13,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:13,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370978978] [2024-09-11 19:50:13,200 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:50:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68456937] [2024-09-11 19:50:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68456937] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:50:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-09-11 19:50:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137154651] [2024-09-11 19:50:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:50:13,203 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:50:13,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:50:13,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:50:13,206 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:50:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:13,776 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-09-11 19:50:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:50:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-11 19:50:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:13,778 INFO L225 Difference]: With dead ends: 36 [2024-09-11 19:50:13,778 INFO L226 Difference]: Without dead ends: 33 [2024-09-11 19:50:13,778 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:50:13,779 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:13,780 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 104 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 19:50:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-11 19:50:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-11 19:50:13,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:50:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-09-11 19:50:13,787 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 30 [2024-09-11 19:50:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:13,788 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-09-11 19:50:13,788 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:50:13,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-09-11 19:50:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 19:50:13,790 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:13,790 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:13,805 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:50:13,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:13,994 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:13,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1303469435, now seen corresponding path program 1 times [2024-09-11 19:50:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:13,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603526476] [2024-09-11 19:50:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:50:14,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744433167] [2024-09-11 19:50:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:14,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:14,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:50:14,046 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:50:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:14,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:50:14,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 19:50:14,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 19:50:14,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603526476] [2024-09-11 19:50:14,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:50:14,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744433167] [2024-09-11 19:50:14,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744433167] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:14,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:50:14,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-09-11 19:50:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151564858] [2024-09-11 19:50:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:50:14,353 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:50:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:14,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:50:14,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:50:14,355 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:50:18,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-11 19:50:22,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-09-11 19:50:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:22,449 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-09-11 19:50:22,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:50:22,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-11 19:50:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:22,451 INFO L225 Difference]: With dead ends: 43 [2024-09-11 19:50:22,451 INFO L226 Difference]: Without dead ends: 41 [2024-09-11 19:50:22,451 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:50:22,452 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:22,452 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 8.1s Time] [2024-09-11 19:50:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-11 19:50:22,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-09-11 19:50:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:50:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-09-11 19:50:22,461 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 32 [2024-09-11 19:50:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:22,461 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-09-11 19:50:22,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:50:22,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-09-11 19:50:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:50:22,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:22,465 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:22,480 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:50:22,669 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:22,670 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:22,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:22,670 INFO L85 PathProgramCache]: Analyzing trace with hash -158878427, now seen corresponding path program 1 times [2024-09-11 19:50:22,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:22,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411421476] [2024-09-11 19:50:22,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:22,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:50:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:50:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:50:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:50:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 19:50:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:50:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:23,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411421476] [2024-09-11 19:50:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411421476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:50:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:50:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:50:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639310136] [2024-09-11 19:50:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:50:23,097 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:50:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:23,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:50:23,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:50:23,097 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:50:23,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:23,141 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-09-11 19:50:23,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:50:23,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-09-11 19:50:23,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:23,143 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:50:23,143 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 19:50:23,144 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:50:23,144 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:23,145 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:50:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 19:50:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-11 19:50:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:50:23,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-09-11 19:50:23,151 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 38 [2024-09-11 19:50:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:23,152 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-09-11 19:50:23,152 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 19:50:23,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-09-11 19:50:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-11 19:50:23,153 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:23,153 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:23,154 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:50:23,154 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:23,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:23,154 INFO L85 PathProgramCache]: Analyzing trace with hash 183265189, now seen corresponding path program 1 times [2024-09-11 19:50:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288864342] [2024-09-11 19:50:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:23,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:50:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:50:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:50:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:50:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:50:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:50:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288864342] [2024-09-11 19:50:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288864342] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983735427] [2024-09-11 19:50:23,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:23,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:23,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:23,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:50:23,298 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 19:50:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:23,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:50:23,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:23,421 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 19:50:23,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 19:50:23,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983735427] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:50:23,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:50:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2024-09-11 19:50:23,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235755876] [2024-09-11 19:50:23,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:23,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 19:50:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 19:50:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:50:23,506 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:50:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:23,767 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-09-11 19:50:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:50:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 38 [2024-09-11 19:50:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:23,768 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:50:23,768 INFO L226 Difference]: Without dead ends: 36 [2024-09-11 19:50:23,769 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:50:23,769 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:23,769 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 189 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:50:23,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-11 19:50:23,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-09-11 19:50:23,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 19:50:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-09-11 19:50:23,779 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 38 [2024-09-11 19:50:23,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:23,779 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-09-11 19:50:23,779 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 19:50:23,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-09-11 19:50:23,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 19:50:23,780 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:23,780 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:23,792 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:50:23,981 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:23,981 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:23,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash 599091488, now seen corresponding path program 1 times [2024-09-11 19:50:23,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:23,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570530372] [2024-09-11 19:50:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:23,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:50:23,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776863470] [2024-09-11 19:50:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:24,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:50:24,001 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:50:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:24,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 19:50:24,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-11 19:50:24,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:24,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570530372] [2024-09-11 19:50:24,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:50:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776863470] [2024-09-11 19:50:24,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776863470] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:24,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:50:24,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-09-11 19:50:24,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874563911] [2024-09-11 19:50:24,503 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:24,504 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:50:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:24,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:50:24,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:50:24,506 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 19:50:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:24,631 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2024-09-11 19:50:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:50:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2024-09-11 19:50:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:24,633 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:50:24,633 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 19:50:24,633 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:50:24,634 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:24,634 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 117 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:50:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 19:50:24,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-11 19:50:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:50:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-09-11 19:50:24,645 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 40 [2024-09-11 19:50:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:24,645 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-09-11 19:50:24,645 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 19:50:24,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-09-11 19:50:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-11 19:50:24,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:24,646 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:24,652 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:50:24,846 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:24,847 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:24,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -2107284293, now seen corresponding path program 2 times [2024-09-11 19:50:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:24,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938064472] [2024-09-11 19:50:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:50:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,211 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:50:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:50:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:50:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 19:50:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:50:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 19:50:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938064472] [2024-09-11 19:50:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938064472] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25011969] [2024-09-11 19:50:25,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:50:25,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:25,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:25,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:50:25,229 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 19:50:25,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:50:25,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:50:25,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-11 19:50:25,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-11 19:50:25,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 19:50:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25011969] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:50:26,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:50:26,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 7] total 21 [2024-09-11 19:50:26,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490218587] [2024-09-11 19:50:26,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:26,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 19:50:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:26,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 19:50:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:50:26,274 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 21 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-11 19:50:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:26,676 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2024-09-11 19:50:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:50:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) Word has length 48 [2024-09-11 19:50:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:26,678 INFO L225 Difference]: With dead ends: 75 [2024-09-11 19:50:26,678 INFO L226 Difference]: Without dead ends: 48 [2024-09-11 19:50:26,679 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:50:26,680 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:26,680 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:50:26,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-11 19:50:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2024-09-11 19:50:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 32 states have internal predecessors, (34), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:50:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-09-11 19:50:26,695 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 48 [2024-09-11 19:50:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:26,695 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-09-11 19:50:26,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-11 19:50:26,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-09-11 19:50:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 19:50:26,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:26,697 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:26,709 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:50:26,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:50:26,897 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:26,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:26,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1064658186, now seen corresponding path program 3 times [2024-09-11 19:50:26,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:26,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019077452] [2024-09-11 19:50:26,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:26,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:50:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274060244] [2024-09-11 19:50:26,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:50:26,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:26,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:26,982 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:50:26,983 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 19:50:27,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:50:27,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:50:27,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-11 19:50:27,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:28,596 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-11 19:50:28,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:37,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 19:50:37,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019077452] [2024-09-11 19:50:37,887 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:50:37,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274060244] [2024-09-11 19:50:37,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274060244] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:50:37,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:50:37,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 24 [2024-09-11 19:50:37,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050281456] [2024-09-11 19:50:37,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:37,888 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 19:50:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:37,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 19:50:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=434, Unknown=1, NotChecked=0, Total=552 [2024-09-11 19:50:37,890 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-11 19:51:34,217 WARN L293 SmtUtils]: Spent 54.86s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:51:37,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:51:53,729 WARN L293 SmtUtils]: Spent 15.33s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:52:13,117 WARN L293 SmtUtils]: Spent 18.61s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:52:22,554 WARN L293 SmtUtils]: Spent 5.31s on a formula simplification. DAG size of input: 81 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:52:26,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-11 19:52:28,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-11 19:52:37,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:52:41,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:52:49,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:53:14,550 WARN L293 SmtUtils]: Spent 23.10s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:53:22,415 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:53:24,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:53:28,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:53:39,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:53:43,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:53:59,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:54:04,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:54:08,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:54:14,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:54:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:54:14,395 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2024-09-11 19:54:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-11 19:54:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) Word has length 50 [2024-09-11 19:54:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:54:14,398 INFO L225 Difference]: With dead ends: 129 [2024-09-11 19:54:14,398 INFO L226 Difference]: Without dead ends: 109 [2024-09-11 19:54:14,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 165.8s TimeCoverageRelationStatistics Valid=368, Invalid=1187, Unknown=5, NotChecked=0, Total=1560 [2024-09-11 19:54:14,399 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 59 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 46 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:54:14,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 277 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 398 Invalid, 10 Unknown, 0 Unchecked, 60.0s Time] [2024-09-11 19:54:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-11 19:54:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2024-09-11 19:54:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 75 states have internal predecessors, (82), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-11 19:54:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2024-09-11 19:54:14,460 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 50 [2024-09-11 19:54:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:54:14,461 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-09-11 19:54:14,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 9 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 8 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-11 19:54:14,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:54:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2024-09-11 19:54:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 19:54:14,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:54:14,463 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:54:14,469 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 19:54:14,663 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-11 19:54:14,664 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:54:14,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:54:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1638008734, now seen corresponding path program 4 times [2024-09-11 19:54:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:54:14,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487049956] [2024-09-11 19:54:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:54:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:54:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:54:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:54:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:54:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:54:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 19:54:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 19:54:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:54:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 19:54:15,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:54:15,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487049956] [2024-09-11 19:54:15,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487049956] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:54:15,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774552426] [2024-09-11 19:54:15,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:54:15,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:54:15,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:54:15,866 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:54:15,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 19:54:15,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:54:15,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:54:15,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 19:54:15,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:54:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 19:54:16,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:54:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 9 proven. 54 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-11 19:54:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774552426] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:54:21,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:54:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 33 [2024-09-11 19:54:21,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794608469] [2024-09-11 19:54:21,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:54:21,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-11 19:54:21,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:54:21,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-11 19:54:21,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 19:54:21,607 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 30 states have internal predecessors, (72), 7 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (15), 8 states have call predecessors, (15), 7 states have call successors, (15) [2024-09-11 19:54:32,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-11 19:54:36,109 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-11 19:54:40,118 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-11 19:54:44,133 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-11 19:54:48,143 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 []