./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5a1422c7f1124202863875c2296d538cebfb680907647840c96a830e98d336c --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:44:47,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:44:47,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:44:47,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:44:47,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:44:47,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:44:47,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:44:47,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:44:47,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:44:47,305 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:44:47,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:44:47,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:44:47,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:44:47,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:44:47,307 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:44:47,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:44:47,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:44:47,308 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:44:47,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:44:47,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:44:47,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:44:47,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:44:47,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:44:47,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:44:47,313 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:44:47,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:44:47,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:44:47,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:44:47,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:44:47,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:44:47,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:44:47,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:44:47,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:47,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:44:47,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:44:47,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:44:47,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:44:47,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:44:47,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:44:47,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:44:47,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:44:47,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:44:47,331 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 -> b5a1422c7f1124202863875c2296d538cebfb680907647840c96a830e98d336c 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:44:47,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:44:47,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:44:47,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:44:47,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:44:47,617 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:44:47,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c [2024-09-11 19:44:49,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:44:49,290 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:44:49,291 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_valuebound5.c [2024-09-11 19:44:49,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e05f0f38d/ca2e7b4e1ecb4c0a8ed65de85eec3607/FLAG0e7e94995 [2024-09-11 19:44:49,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e05f0f38d/ca2e7b4e1ecb4c0a8ed65de85eec3607 [2024-09-11 19:44:49,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:44:49,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:44:49,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:44:49,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:44:49,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:44:49,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16adccd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49, skipping insertion in model container [2024-09-11 19:44:49,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,353 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:44:49,521 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/dijkstra-u_valuebound5.c[525,538] [2024-09-11 19:44:49,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:44:49,578 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:44:49,588 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/dijkstra-u_valuebound5.c[525,538] [2024-09-11 19:44:49,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:44:49,621 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:44:49,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49 WrapperNode [2024-09-11 19:44:49,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:44:49,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:44:49,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:44:49,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:44:49,630 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:44:49" (1/1) ... [2024-09-11 19:44:49,640 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:44:49" (1/1) ... [2024-09-11 19:44:49,666 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2024-09-11 19:44:49,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:44:49,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:44:49,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:44:49,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:44:49,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,698 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:44:49,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:44:49,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:44:49,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:44:49,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:44:49,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (1/1) ... [2024-09-11 19:44:49,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:44:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:49,757 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:44:49,765 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:44:49,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:44:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:44:49,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:44:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:44:49,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:44:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:44:49,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:44:49,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:44:49,866 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:44:49,869 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:44:50,175 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:44:50,175 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:44:50,198 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:44:50,199 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:44:50,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:44:50 BoogieIcfgContainer [2024-09-11 19:44:50,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:44:50,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:44:50,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:44:50,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:44:50,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:44:49" (1/3) ... [2024-09-11 19:44:50,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e17c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:44:50, skipping insertion in model container [2024-09-11 19:44:50,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:44:49" (2/3) ... [2024-09-11 19:44:50,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e17c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:44:50, skipping insertion in model container [2024-09-11 19:44:50,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:44:50" (3/3) ... [2024-09-11 19:44:50,209 INFO L112 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.c [2024-09-11 19:44:50,225 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:44:50,226 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:44:50,290 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:44:50,297 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;@360d35d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:44:50,297 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:44:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:44:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:44:50,312 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:50,312 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:50,313 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:50,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash -10312671, now seen corresponding path program 1 times [2024-09-11 19:44:50,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:50,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400301570] [2024-09-11 19:44:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:50,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:50,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:50,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:50,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:50,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400301570] [2024-09-11 19:44:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400301570] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:50,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:44:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841619585] [2024-09-11 19:44:50,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:50,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:44:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:50,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:44:50,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:44:50,567 INFO L87 Difference]: Start difference. First operand has 30 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:44:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:50,602 INFO L93 Difference]: Finished difference Result 58 states and 102 transitions. [2024-09-11 19:44:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:44:50,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-11 19:44:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:50,612 INFO L225 Difference]: With dead ends: 58 [2024-09-11 19:44:50,612 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 19:44:50,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:44:50,620 INFO L434 NwaCegarLoop]: 39 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, 39 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:44:50,621 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:44:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 19:44:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 19:44:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 19:44:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-09-11 19:44:50,655 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 18 [2024-09-11 19:44:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:50,656 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-09-11 19:44:50,656 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:44:50,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-09-11 19:44:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:44:50,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:50,658 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:50,658 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:44:50,658 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:50,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 763841584, now seen corresponding path program 1 times [2024-09-11 19:44:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978610593] [2024-09-11 19:44:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:51,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:51,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978610593] [2024-09-11 19:44:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978610593] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:44:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:44:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:44:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907880909] [2024-09-11 19:44:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:44:51,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:44:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:51,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:44:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:44:51,121 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:52,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:44:56,551 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:44:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:44:56,554 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-09-11 19:44:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:44:56,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-11 19:44:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:44:56,566 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:44:56,566 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:44:56,566 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:44:56,567 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:44:56,568 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 158 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-09-11 19:44:56,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:44:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 19:44:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 19:44:56,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-09-11 19:44:56,596 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 19 [2024-09-11 19:44:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:44:56,596 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-09-11 19:44:56,597 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:44:56,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:56,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-09-11 19:44:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:44:56,599 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:44:56,599 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:44:56,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:44:56,600 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:44:56,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:44:56,600 INFO L85 PathProgramCache]: Analyzing trace with hash -82339253, now seen corresponding path program 1 times [2024-09-11 19:44:56,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:44:56,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775162717] [2024-09-11 19:44:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:44:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:56,964 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:44:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:56,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:44:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:44:56,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775162717] [2024-09-11 19:44:56,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775162717] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:44:56,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103396825] [2024-09-11 19:44:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:44:56,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:44:56,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:44:56,981 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:44:56,983 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:44:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:44:57,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:44:57,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:44:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:57,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:44:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:44:57,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103396825] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:44:57,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:44:57,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-11 19:44:57,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005417992] [2024-09-11 19:44:57,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:44:57,437 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:44:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:44:57,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:44:57,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:44:57,439 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:45:00,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:45:05,139 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:45:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:05,204 INFO L93 Difference]: Finished difference Result 111 states and 177 transitions. [2024-09-11 19:45:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:45:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-11 19:45:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:05,208 INFO L225 Difference]: With dead ends: 111 [2024-09-11 19:45:05,208 INFO L226 Difference]: Without dead ends: 93 [2024-09-11 19:45:05,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:45:05,210 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 97 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:05,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 269 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 179 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-09-11 19:45:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-11 19:45:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 61. [2024-09-11 19:45:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 25 states have call successors, (25), 4 states have call predecessors, (25), 4 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-11 19:45:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-09-11 19:45:05,242 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 21 [2024-09-11 19:45:05,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:05,243 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-09-11 19:45:05,243 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 13 states have internal predecessors, (27), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:45:05,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-09-11 19:45:05,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-11 19:45:05,246 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:05,247 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:05,264 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:45:05,451 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,452 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:05,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,452 INFO L85 PathProgramCache]: Analyzing trace with hash -93184560, now seen corresponding path program 1 times [2024-09-11 19:45:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868716618] [2024-09-11 19:45:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [550056306] [2024-09-11 19:45:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:05,476 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:45:05,478 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:45:05,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:05,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:45:05,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:45:05,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:45:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868716618] [2024-09-11 19:45:05,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550056306] [2024-09-11 19:45:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550056306] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:45:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:45:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:45:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658396869] [2024-09-11 19:45:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:45:05,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:45:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:05,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:45:05,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:45:05,615 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:45:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:45:05,710 INFO L93 Difference]: Finished difference Result 86 states and 123 transitions. [2024-09-11 19:45:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:45:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-11 19:45:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:45:05,712 INFO L225 Difference]: With dead ends: 86 [2024-09-11 19:45:05,712 INFO L226 Difference]: Without dead ends: 83 [2024-09-11 19:45:05,713 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:45:05,713 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:45:05,714 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:45:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-11 19:45:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-11 19:45:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-09-11 19:45:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 119 transitions. [2024-09-11 19:45:05,733 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 119 transitions. Word has length 29 [2024-09-11 19:45:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:45:05,733 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 119 transitions. [2024-09-11 19:45:05,734 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:45:05,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 119 transitions. [2024-09-11 19:45:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 19:45:05,735 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:45:05,735 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:45:05,752 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:45:05,939 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,940 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:45:05,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:45:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 471953405, now seen corresponding path program 1 times [2024-09-11 19:45:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:45:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378237014] [2024-09-11 19:45:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:45:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:45:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1354034669] [2024-09-11 19:45:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:45:05,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:45:05,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:45:05,972 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:45:05,975 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:45:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:45:06,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:45:06,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:45:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:06,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:45:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:45:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:45:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378237014] [2024-09-11 19:45:07,752 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:45:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354034669] [2024-09-11 19:45:07,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354034669] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:45:07,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:45:07,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 19:45:07,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539951684] [2024-09-11 19:45:07,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:45:07,754 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:45:07,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:45:07,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:45:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:45:07,755 INFO L87 Difference]: Start difference. First operand 83 states and 119 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 19:45:17,897 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:45:21,981 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:45:23,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:25,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:31,300 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:45:35,581 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:45:39,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:45:43,603 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:45:47,608 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:45:52,333 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:45:56,424 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:46:00,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:04,507 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:46:09,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:46:09,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:46:09,746 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2024-09-11 19:46:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:46:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-09-11 19:46:09,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:46:09,748 INFO L225 Difference]: With dead ends: 152 [2024-09-11 19:46:09,748 INFO L226 Difference]: Without dead ends: 128 [2024-09-11 19:46:09,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2024-09-11 19:46:09,750 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 21 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 54 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.8s IncrementalHoareTripleChecker+Time [2024-09-11 19:46:09,750 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 270 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 188 Invalid, 12 Unknown, 0 Unchecked, 55.8s Time] [2024-09-11 19:46:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-11 19:46:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2024-09-11 19:46:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 60 states have internal predecessors, (68), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-11 19:46:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 176 transitions. [2024-09-11 19:46:09,799 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 176 transitions. Word has length 28 [2024-09-11 19:46:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:46:09,800 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 176 transitions. [2024-09-11 19:46:09,800 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 19:46:09,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:09,801 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 176 transitions. [2024-09-11 19:46:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 19:46:09,804 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:46:09,804 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:46:09,811 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:46:10,004 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:46:10,005 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:46:10,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:10,005 INFO L85 PathProgramCache]: Analyzing trace with hash -416609438, now seen corresponding path program 1 times [2024-09-11 19:46:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:46:10,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278981730] [2024-09-11 19:46:10,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:46:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:46:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:46:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 19:46:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 19:46:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:46:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:46:10,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278981730] [2024-09-11 19:46:10,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278981730] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:46:10,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609892083] [2024-09-11 19:46:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:10,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:10,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:46:10,268 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:46:10,269 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:46:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:10,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:46:10,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:46:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-11 19:46:10,408 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:46:10,572 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:46:10,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609892083] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:46:10,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:46:10,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-09-11 19:46:10,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916800963] [2024-09-11 19:46:10,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:46:10,573 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:46:10,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:10,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:46:10,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:46:10,575 INFO L87 Difference]: Start difference. First operand 122 states and 176 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-11 19:46:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:46:12,147 INFO L93 Difference]: Finished difference Result 173 states and 248 transitions. [2024-09-11 19:46:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:46:12,148 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 40 [2024-09-11 19:46:12,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:46:12,150 INFO L225 Difference]: With dead ends: 173 [2024-09-11 19:46:12,150 INFO L226 Difference]: Without dead ends: 131 [2024-09-11 19:46:12,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:46:12,151 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-11 19:46:12,152 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 461 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-11 19:46:12,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-11 19:46:12,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2024-09-11 19:46:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 55 states have call successors, (55), 9 states have call predecessors, (55), 9 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-09-11 19:46:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-09-11 19:46:12,189 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 40 [2024-09-11 19:46:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:46:12,190 INFO L474 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-09-11 19:46:12,190 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 13 states have internal predecessors, (39), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-11 19:46:12,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-09-11 19:46:12,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 19:46:12,193 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:46:12,193 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:46:12,211 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:46:12,398 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:46:12,399 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:46:12,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:46:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -208842498, now seen corresponding path program 1 times [2024-09-11 19:46:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:46:12,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231982546] [2024-09-11 19:46:12,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:46:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:46:12,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116388277] [2024-09-11 19:46:12,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:46:12,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:46:12,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:46:12,448 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:46:12,450 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:46:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:46:12,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-11 19:46:12,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:46:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 19:46:12,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:46:24,884 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:46:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 31 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-11 19:46:49,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:46:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231982546] [2024-09-11 19:46:49,590 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:46:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116388277] [2024-09-11 19:46:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116388277] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:46:49,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:46:49,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-09-11 19:46:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503324278] [2024-09-11 19:46:49,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:46:49,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:46:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:46:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:46:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:46:49,592 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-11 19:46:53,799 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:46:57,808 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:47:01,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:47:05,837 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:47:07,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:11,236 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:47:15,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 19:47:19,267 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:47:23,282 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:47:27,294 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:47:31,307 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:47:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:47:31,962 INFO L93 Difference]: Finished difference Result 129 states and 180 transitions. [2024-09-11 19:47:31,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:47:31,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 55 [2024-09-11 19:47:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:47:31,966 INFO L225 Difference]: With dead ends: 129 [2024-09-11 19:47:31,966 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 19:47:31,967 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:47:31,968 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 36 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:47:31,968 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 89 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 103 Invalid, 10 Unknown, 0 Unchecked, 42.3s Time] [2024-09-11 19:47:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 19:47:32,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-09-11 19:47:32,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-09-11 19:47:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-09-11 19:47:32,003 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 55 [2024-09-11 19:47:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:47:32,003 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-09-11 19:47:32,004 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-11 19:47:32,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:47:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-09-11 19:47:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-11 19:47:32,005 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:47:32,005 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:47:32,027 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:47:32,206 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:47:32,206 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:47:32,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:47:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2119770422, now seen corresponding path program 1 times [2024-09-11 19:47:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:47:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364468172] [2024-09-11 19:47:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:47:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:47:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:47:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:47:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:47:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-11 19:47:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 19:47:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:47:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-11 19:47:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 19:47:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-11 19:47:33,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:47:33,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364468172] [2024-09-11 19:47:33,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364468172] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:47:33,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410879367] [2024-09-11 19:47:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:47:33,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:47:33,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:47:33,246 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:47:33,248 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:47:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:47:33,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-11 19:47:33,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:47:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-11 19:47:35,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:47:58,363 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:48:06,410 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:48:31,152 WARN L293 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:48:47,556 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:49:11,952 WARN L293 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:49:24,281 WARN L293 SmtUtils]: Spent 12.17s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:49:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-11 19:49:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410879367] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:49:24,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:49:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 23 [2024-09-11 19:49:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803731714] [2024-09-11 19:49:24,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:49:24,308 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 19:49:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 19:49:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=420, Unknown=5, NotChecked=0, Total=506 [2024-09-11 19:49:24,309 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 23 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 8 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)